Finitary Coloring
نویسندگان
چکیده
Suppose that the vertices of Z are assigned random colors via a finitary factor of independent identically distributed (iid) vertex-labels. That is, the color of vertex v is determined by a rule that examines the labels within a finite (but random and perhaps unbounded) distance R of v, and the same rule applies at all vertices. We investigate the tail behavior of R if the coloring is required to be proper (that is, if adjacent vertices must receive different colors). When d ≥ 2, the optimal tail is given by a power law for 3 colors, and a tower (iterated exponential) function for 4 or more colors (and also for 3 or more colors when d = 1). If proper coloring is replaced with any shift of finite type in dimension 1, then, apart from trivial cases, tower function behavior also applies.
منابع مشابه
One-dependent Coloring by Finitary Factors
Holroyd and Liggett recently proved the existence of a stationary 1-dependent 4-coloring of the integers, the first stationary k-dependent q-coloring for any k and q. That proof specifies a consistent family of finite-dimensional distributions, but does not yield a probabilistic construction on the whole integer line. Here we prove that the process can be expressed as a finitary factor of an i....
متن کاملFinitary Coding of the Sub-critical Ising Model with Finite Expected Coding Volume
It has been shown by van den Berg and Steif [3] that the sub-critical Ising model on Z is a finitary factor of a finite-valued i.i.d. process. We strengthen this by showing that the factor map can be made to have finite expected coding volume (in fact, stretched-exponential tails), answering a question of van den Berg and Steif [3]. The result holds at any temperature above the critical tempera...
متن کاملSemantics of linear logic and higher-order model-checking. (Sémantique de la logique linéaire et "model-checking" d'ordre supérieur)
This thesis studies problems of higher-order model-checking from a semantic and logical perspective. Higher-order model-checking is concerned with the verification of properties expressed in monadic second-order logic, specified over infinite trees generated by a class of rewriting systems called higher-order recursion schemes. These systems are equivalent to simply-typed λ-terms with recursion...
متن کاملMallows Permutations and Finite Dependence
We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as finitary factors of i.i.d. processes with finite mean coding radii. They are the first colorings known to have these properties. Moreover, we prove that the coding radii have exponential tails, and that the colorings ...
متن کاملDefinability, Canonical Models, and Compactness for Finitary Coalgebraic Modal Logic
This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T ) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logi...
متن کامل